Importance Sampling in Bayesian Networks: An Influence-Based Approximation Strategy for Importance Functions

نویسندگان

  • Changhe Yuan
  • Marek J. Druzdzel
چکیده

One of the main problems of importance sampling in Bayesian networks is representation of the importance function, which should ideally be as close as possible to the posterior joint distribution. Typically, we represent an importance function as a factorization, i.e., product of conditional probability tables (CPTs). Given diagnostic evidence, we do not have explicit forms for the CPTs in the networks. We first derive the exact form for the CPTs of the optimal importance function. Since the calculation is hard, we usually only use their approximations. We review several popular strategies and point out their limitations. Based on an analysis of the influence of evidence, we propose a method for approximating the exact form of importance function by explicitly modeling the most important additional dependence relations introduced by evidence. Our experimental results show that the new approximation strategy offers an immediate improvement in the quality of the importance function.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Importance Sampling for Bayesian

Bayesian networks (BNs) offer a compact, intuitive, and efficient graphical representation of uncertain relationships among the variables in a domain and have proven their value in many disciplines over the last two decades. However, two challenges become increasingly critical in practical applications of Bayesian networks. First, real models are reaching the size of hundreds or even thousands ...

متن کامل

An Importance Sampling Algorithm Based on Evidence Pre-propagation

Precision achieved by stochastic sampling al­ gorithms for Bayesian networks typically de­ teriorates in face of extremely unlikely ev­ idence. To address this problem, we pro­ pose the Evidence Pre-propagation Impor­ tance Sampling algorithm (EPIS-BN), an importance sampling algorithm that com­ putes an approximate importance function using two techniques: loopy belief propaga­ tion [19, 25] a...

متن کامل

Local Importance Sampling in Multiply Sectioned Bayesian Networks

The multiply sectioned Bayesian network (MSBN) is a well-studied model for probability reasoning in a multiagent setting. Exact inference, however, becomes difficult as the problem domain grows larger and more complex. We address this issue by integrating approximation techniques with the MSBN Linked Junction Tree Forest (LJF) framework. In particular, we investigate the application of importan...

متن کامل

Importance Sampling for General Hybrid Bayesian Networks

Some real problems are more naturally modeled by hybrid Bayesian networks that consist of mixtures of continuous and discrete variables with their interactions described by equations and continuous probability distributions. However, inference in such general hybrid models is hard. Therefore, existing approaches either only deal with special instances, such as Conditional Linear Gaussians (CLGs...

متن کامل

Refractor Importance Sampling

In this paper we introduce Refractor Importance Sampling (RIS), an improvement to reduce error variance in Bayesian network importance sampling propagation under evidential reasoning. We prove the existence of a collection of importance functions that are close to the optimal importance function under evidential reasoning. Based on this theoretic result we derive the RIS algorithm. RIS approach...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1207.1422  شماره 

صفحات  -

تاریخ انتشار 2012